class Solution:
def canConstruct(self, ransomNote: str, magazine: str) -> bool:
dic1 = {}
dic2 ={}
for i in range(len(ransomNote)):
if ransomNote[i] in dic1:
dic1[ransomNote[i]] +=1
else:
dic1[ransomNote[i]] = 1
for i in range(len(magazine)):
if magazine[i] in dic2:
dic2[magazine[i]] +=1
else:
dic2[magazine[i]] = 1
for i in dic1:
if i in dic2:
if dic1[i]<=dic2[i]:
continue
else:
return False
else:
return False
return True
198. House Robber | 153. Find Minimum in Rotated Sorted Array |
150. Evaluate Reverse Polish Notation | 144. Binary Tree Preorder Traversal |
137. Single Number II | 130. Surrounded Regions |
129. Sum Root to Leaf Numbers | 120. Triangle |
102. Binary Tree Level Order Traversal | 96. Unique Binary Search Trees |
75. Sort Colors | 74. Search a 2D Matrix |
71. Simplify Path | 62. Unique Paths |
50. Pow(x, n) | 43. Multiply Strings |
34. Find First and Last Position of Element in Sorted Array | 33. Search in Rotated Sorted Array |
17. Letter Combinations of a Phone Number | 5. Longest Palindromic Substring |
3. Longest Substring Without Repeating Characters | 1312. Minimum Insertion Steps to Make a String Palindrome |
1092. Shortest Common Supersequence | 1044. Longest Duplicate Substring |
1032. Stream of Characters | 987. Vertical Order Traversal of a Binary Tree |
952. Largest Component Size by Common Factor | 212. Word Search II |
174. Dungeon Game | 127. Word Ladder |